Analysis of threat based algorithm using different performance measures

Since its introduction in 1985, competitive analysis is a widely used tool for the performance measurement of online algorithms. Despite simplicity and popularity, has own set drawbacks which lead to development other measures. However, these measures were seldom applied problems domains. Recently Boyar et al . ( Theor. Comput. Sci 532 (2014) 2–13) studied search problem using various non-preemptive We extend work by considering preemptive threat-based algorithms evaluate it analysis, bijective average case relative interval analysis. For our findings are contrast with that ., whereas complement